package review;

public class Jiechen {
	// 阶乘
	// 1 1 1 1 1 1 1 1 1 1
	public static long jiechen(int k) {
		if (k <= 1)
			return 1L;
		return k * jiechen(k - 1);
	}

	public static int count = 0;

	// 斐波拉切 数列的第k项
	public static long fb(int k) {
		count++;
		if (k <= 2)
			return 1L;
		return fb(k - 1) + fb(k - 2);
	}

	public static void main(String[] args) {
//		long res = jiechen(10);//1+2+4+8+2^8= 2^9-1
//	 System.out.println(res);
		long res2 = fb(10);
		System.out.println(res2);
	}
}
